State Complexity Advantages of Ultrametric Automata
نویسنده
چکیده
Ultrametric automata have properties similar to the properties of probabilistic automata but the descriptional power of these types of automata can differ very much. In this paper, we compare ultrametric automata with deterministic, nondeterministic, probabilistic and alternating automata with various state complexities. We also show that two-way ultrametric automata can have a smaller state complexity than one-way ultrametric automata.
منابع مشابه
Experiments in Complexity of Probabilistic and Ultrametric Automata
We try to compare the complexity of deterministic, nondeterministic, probabilistic and ultrametric finite automata for the same language. We do not claim to have final upper and lower bounds. Rather these results can be considered as experiments to find advantages of one type of automata versus another type.
متن کاملUltrametric Automata with One Head Versus Multihead Nondeterministic Automata
The idea of using p-adic numbers in Turing machines and finite automata to describe random branching of the process of computation was recently introduced. In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored. In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automat...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملUnconventional Finite Automata and Algorithms
We investigate several unconventional models of finite automata and algorithms. We show that two-way alternating automata can be smaller than fast bounded-error probabilistic automata. We introduce ultrametric finite automata which use p-adic numbers to describe the branching process of the computation. We examine the size complexity of all the abovementioned automata for the counting problem. ...
متن کاملKaspars Balodis Unconventional Finite Automata and Algorithms Doctoral
In this thesis we investigate several unconventional models of finite automata and algorithms. We start with more conventional types of automata and prove differentiation results for the descriptional complexity classes of twoway probabilistic and alternating finite automata. Then we introduce ultrametric finite automata which use p-adic numbers as amplitudes describing the branching process of...
متن کامل